Univariate polynomial solutions of algebraic difference equations

نویسندگان

  • Olha Shkaravska
  • Marko C. J. D. van Eekelen
چکیده

Contrary to linear difference equations, there is no general theory of difference equations of the form G(P (x − τ1), . . . , P (x − τs)) + G0(x)=0, with τi ∈ K, G(x1, . . . , xs) ∈ K[x1, . . . , xs] of total degree D ≥ 2 and G0(x) ∈ K[x], where K is a field of characteristic zero. This article is concerned with the following problem: given τi, G and G0, find an upper bound on the degree d of a polynomial solution P (x), if it exists. In the presented approach the problem is reduced to constructing a univariate polynomial for which d is a root. The authors formulate a sufficient condition under which such a polynomial exists. Using this condition, they give an effective bound on d, for instance, for all difference equations of the form G ( P (x − a), P (x − a − 1), P (x − a − 2) ) + G0(x) = 0 with quadratic G, and all difference equations of the form G ( P (x), P (x− τ) ) +G0(x) = 0 with G having an arbitrary degree.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Solving Parametric Polynomial Equations and Inequalities by Symbolic Algorithms

The talk gives a survey on some symbolic algorithmic methods for solving systems of algebraic equations with special emphasis on parametric systems. Besides complex solutions I consider also real solutions of systems including inequalities. The techniques described include the Euclidean algorithm, Grr obner bases, characteristic sets, univariate and multivariate Sturm-Sylvester theorems, compre...

متن کامل

NUMERICAL SOLUTION OF THE MOST GENERAL NONLINEAR FREDHOLM INTEGRO-DIFFERENTIAL-DIFFERENCE EQUATIONS BY USING TAYLOR POLYNOMIAL APPROACH

In this study, a Taylor method is developed for numerically solving the high-order most general nonlinear Fredholm integro-differential-difference equations in terms of Taylor expansions. The method is based on transferring the equation and conditions into the matrix equations which leads to solve a system of nonlinear algebraic equations with the unknown Taylor coefficients. Also, we test the ...

متن کامل

Univariate Polynomial Solutions of Nonlinear Polynomial Difference Equations

We study real-polynomial solutions P (x) of difference equations of the formG(P (x−τ1), . . . , P (x− τs)) +G0(x)=0, where τi are real numbers, G(x1, . . . , xs) is a real polynomial of a total degree D ≥ 2, and G0(x) is a polynomial in x. We consider the following problem: given τi, G and G0, find an upper bound on the degree d of a real-polynomial solution P (x), if exists. We reduce this pro...

متن کامل

Affine Difference Algebraic Groups

The central objects of study in this thesis are affine difference algebraic groups. Similar to the case of affine algebraic groups, these groups can all be realized as subgroups of some general linear group defined by algebraic difference equations. However, the defining equations here are not simply polynomials in the matrix entries but difference polynomials, i.e., the defining equations invo...

متن کامل

Solving systems of high-order linear differential– difference equations via Euler matrix method

Differential–difference equation; Collocation points; Polynomial solutions Abstract This paper contributes a new matrix method for solving systems of high-order linear differential–difference equations with variable coefficients under given initial conditions. On the basis of the presented approach, the matrix forms of the Euler polynomials and their derivatives are constructed, and then by sub...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • J. Symb. Comput.

دوره 60  شماره 

صفحات  -

تاریخ انتشار 2014